Elementary recursive quantifier elimination based on Thom encoding and sign determination

نویسندگان

  • Daniel Perrucci
  • Marie-Françoise Roy
چکیده

We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifier Elimination in Term Algebras The Case of Finite Languages

We give a quantifier elimination procedure for term algebras over suitably expanded finite first-order languages. Our expansion is purely functional. Our method works by substituting finitely many parametric test terms. This allows us to obtain in addition sample solutions for an outermost existential quantifier block. The existence of our method implies that the considered quantifier eliminati...

متن کامل

Quantifier elimination for the reals with a predicate for the powers of two

In [5], van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretic argument, which provides no apparent bounds on the complexity of a decision procedure. We provide a syntactic argument that yields a procedure that is primitive recursive, although not el...

متن کامل

Elimination of Skolem functions for monotone formulas in analysis

GnA ω +∆+AC-qf ⊢ ∀u, k∀v ≤τ tuk∃w A0(u, k, v, w), (where t is a closed term, A0 is quantifier-free and contains only u, k, v, w free, γ ≤ 2, ρ is an arbitrary type and ≤τ is defined pointwise) one can extract (by monotone functional interpretation) a uniform bound Φ on ∃w which is given by a closed term of GnA ω and does not depend on v, i.e. ∀u, k∀v ≤ tuk∃w ≤ ΦukA0(u, k, v, w) holds in the ful...

متن کامل

Quantifier Elimination in Elementary Set Theory

In the current paper we provide two methods for quantifier elimination applicable to a large class of formulas of the elementary set theory. The first one adapts the Ackermann method [1] and the second one adapts the fixpoint method of [20]. We show applications of the proposed techniques in the theory of correspondence between modal logics and elementary set theory. The proposed techniques can...

متن کامل

Quantifier Elimination for Linear Arithmetic

This article formalizes quantifier elimination procedures for dense linear orders, linear real arithmetic and Presburger arithmetic. In each case both a DNF-based non-elementary algorithm and one or more (doubly) exponential NNF-based algorithms are formalized, including the well-known algorithms by Ferrante and Rackoff and by Cooper. The NNF-based algorithms for dense linear orders are new but...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 168  شماره 

صفحات  -

تاریخ انتشار 2017